443 research outputs found
Semi-Supervised Overlapping Community Finding based on Label Propagation with Pairwise Constraints
Algorithms for detecting communities in complex networks are generally
unsupervised, relying solely on the structure of the network. However, these
methods can often fail to uncover meaningful groupings that reflect the
underlying communities in the data, particularly when those structures are
highly overlapping. One way to improve the usefulness of these algorithms is by
incorporating additional background information, which can be used as a source
of constraints to direct the community detection process. In this work, we
explore the potential of semi-supervised strategies to improve algorithms for
finding overlapping communities in networks. Specifically, we propose a new
method, based on label propagation, for finding communities using a limited
number of pairwise constraints. Evaluations on synthetic and real-world
datasets demonstrate the potential of this approach for uncovering meaningful
community structures in cases where each node can potentially belong to more
than one community.Comment: Fix table
Communities as Well Separated Subgraphs With Cohesive Cores: Identification of Core-Periphery Structures in Link Communities
Communities in networks are commonly considered as highly cohesive subgraphs
which are well separated from the rest of the network. However, cohesion and
separation often cannot be maximized at the same time, which is why a
compromise is sought by some methods. When a compromise is not suitable for the
problem to be solved it might be advantageous to separate the two criteria. In
this paper, we explore such an approach by defining communities as well
separated subgraphs which can have one or more cohesive cores surrounded by
peripheries. We apply this idea to link communities and present an algorithm
for constructing hierarchical core-periphery structures in link communities and
first test results.Comment: 12 pages, 2 figures, submitted version of a paper accepted for the
7th International Conference on Complex Networks and Their Applications,
December 11-13, 2018, Cambridge, UK; revised version at
http://141.20.126.227/~qm/papers
Geographic constraints on social network groups
Social groups are fundamental building blocks of human societies. While our
social interactions have always been constrained by geography, it has been
impossible, due to practical difficulties, to evaluate the nature of this
restriction on social group structure. We construct a social network of
individuals whose most frequent geographical locations are also known. We also
classify the individuals into groups according to a community detection
algorithm. We study the variation of geographical span for social groups of
varying sizes, and explore the relationship between topological positions and
geographic positions of their members. We find that small social groups are
geographically very tight, but become much more clumped when the group size
exceeds about 30 members. Also, we find no correlation between the topological
positions and geographic positions of individuals within network communities.
These results suggest that spreading processes face distinct structural and
spatial constraints.Comment: 10 pages, 5 figure
Searching for network modules
When analyzing complex networks a key target is to uncover their modular
structure, which means searching for a family of modules, namely node subsets
spanning each a subnetwork more densely connected than the average. This work
proposes a novel type of objective function for graph clustering, in the form
of a multilinear polynomial whose coefficients are determined by network
topology. It may be thought of as a potential function, to be maximized, taking
its values on fuzzy clusterings or families of fuzzy subsets of nodes over
which every node distributes a unit membership. When suitably parametrized,
this potential is shown to attain its maximum when every node concentrates its
all unit membership on some module. The output thus is a partition, while the
original discrete optimization problem is turned into a continuous version
allowing to conceive alternative search strategies. The instance of the problem
being a pseudo-Boolean function assigning real-valued cluster scores to node
subsets, modularity maximization is employed to exemplify a so-called quadratic
form, in that the scores of singletons and pairs also fully determine the
scores of larger clusters, while the resulting multilinear polynomial potential
function has degree 2. After considering further quadratic instances, different
from modularity and obtained by interpreting network topology in alternative
manners, a greedy local-search strategy for the continuous framework is
analytically compared with an existing greedy agglomerative procedure for the
discrete case. Overlapping is finally discussed in terms of multiple runs, i.e.
several local searches with different initializations.Comment: 10 page
Neural development features: Spatio-temporal development of the Caenorhabditis elegans neuronal network
The nematode Caenorhabditis elegans, with information on neural connectivity,
three-dimensional position and cell linage provides a unique system for
understanding the development of neural networks. Although C. elegans has been
widely studied in the past, we present the first statistical study from a
developmental perspective, with findings that raise interesting suggestions on
the establishment of long-distance connections and network hubs. Here, we
analyze the neuro-development for temporal and spatial features, using birth
times of neurons and their three-dimensional positions. Comparisons of growth
in C. elegans with random spatial network growth highlight two findings
relevant to neural network development. First, most neurons which are linked by
long-distance connections are born around the same time and early on,
suggesting the possibility of early contact or interaction between connected
neurons during development. Second, early-born neurons are more highly
connected (tendency to form hubs) than later born neurons. This indicates that
the longer time frame available to them might underlie high connectivity. Both
outcomes are not observed for random connection formation. The study finds that
around one-third of electrically coupled long-range connections are late
forming, raising the question of what mechanisms are involved in ensuring their
accuracy, particularly in light of the extremely invariant connectivity
observed in C. elegans. In conclusion, the sequence of neural network
development highlights the possibility of early contact or interaction in
securing long-distance and high-degree connectivity
Mesoscopic organization reveals the constraints governing C. elegans nervous system
One of the biggest challenges in biology is to understand how activity at the
cellular level of neurons, as a result of their mutual interactions, leads to
the observed behavior of an organism responding to a variety of environmental
stimuli. Investigating the intermediate or mesoscopic level of organization in
the nervous system is a vital step towards understanding how the integration of
micro-level dynamics results in macro-level functioning. In this paper, we have
considered the somatic nervous system of the nematode Caenorhabditis elegans,
for which the entire neuronal connectivity diagram is known. We focus on the
organization of the system into modules, i.e., neuronal groups having
relatively higher connection density compared to that of the overall network.
We show that this mesoscopic feature cannot be explained exclusively in terms
of considerations, such as optimizing for resource constraints (viz., total
wiring cost) and communication efficiency (i.e., network path length).
Comparison with other complex networks designed for efficient transport (of
signals or resources) implies that neuronal networks form a distinct class.
This suggests that the principal function of the network, viz., processing of
sensory information resulting in appropriate motor response, may be playing a
vital role in determining the connection topology. Using modular spectral
analysis, we make explicit the intimate relation between function and structure
in the nervous system. This is further brought out by identifying functionally
critical neurons purely on the basis of patterns of intra- and inter-modular
connections. Our study reveals how the design of the nervous system reflects
several constraints, including its key functional role as a processor of
information.Comment: Published version, Minor modifications, 16 pages, 9 figure
Influence of wiring cost on the large-scale architecture of human cortical connectivity
In the past two decades some fundamental properties of cortical connectivity have been discovered: small-world structure, pronounced hierarchical and modular organisation, and strong core and rich-club structures. A common assumption when interpreting results of this kind is that the observed structural properties are present to enable the brain's function. However, the brain is also embedded into the limited space of the skull and its wiring has associated developmental and metabolic costs. These basic physical and economic aspects place separate, often conflicting, constraints on the brain's connectivity, which must be characterized in order to understand the true relationship between brain structure and function. To address this challenge, here we ask which, and to what extent, aspects of the structural organisation of the brain are conserved if we preserve specific spatial and topological properties of the brain but otherwise randomise its connectivity. We perform a comparative analysis of a connectivity map of the cortical connectome both on high- and low-resolutions utilising three different types of surrogate networks: spatially unconstrained (‘random’), connection length preserving (‘spatial’), and connection length optimised (‘reduced’) surrogates. We find that unconstrained randomisation markedly diminishes all investigated architectural properties of cortical connectivity. By contrast, spatial and reduced surrogates largely preserve most properties and, interestingly, often more so in the reduced surrogates. Specifically, our results suggest that the cortical network is less tightly integrated than its spatial constraints would allow, but more strongly segregated than its spatial constraints would necessitate. We additionally find that hierarchical organisation and rich-club structure of the cortical connectivity are largely preserved in spatial and reduced surrogates and hence may be partially attributable to cortical wiring constraints. In contrast, the high modularity and strong s-core of the high-resolution cortical network are significantly stronger than in the surrogates, underlining their potential functional relevance in the brain
Identifying the structure of Zn-N-2 active sites and structural activation
Identification of active sites is one of the main obstacles to rational design of catalysts for diverse applications. Fundamental insight into the identification of the structure of active sites and structural contributions for catalytic performance are still lacking. Recently, X-ray absorption spectroscopy (XAS) and density functional theory (DFT) provide important tools to disclose the electronic, geometric and catalytic natures of active sites. Herein, we demonstrate the structural identification of Zn-N-2 active sites with both experimental/theoretical X-ray absorption near edge structure (XANES) and extended X-ray absorption fine structure (EXAFS) spectra. Further DFT calculations reveal that the oxygen species activation on Zn-N-2 active sites is significantly enhanced, which can accelerate the reduction of oxygen with high selectivity, according well with the experimental results. This work highlights the identification and investigation of Zn-N-2 active sites, providing a regular principle to obtain deep insight into the nature of catalysts for various catalytic applications
Composition and Structure of a Large Online Social Network in the Netherlands
Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in the Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for the Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities
- …